A Comparison of Algorithm Generated Sectorizations

This paper discusses a comparison of several algorithm generated airspace boundary designs, known as sectorizations. Three algorithms are chosen that approach the airspace sectorization problem in different ways and produce radically different looking sectorizations due to the disparity in their methods. Simulations of air traffic using each of the sectorizations is completed and their resulting demand, capacity, complexity, and delay metrics are compared. Results identify strengths and weaknesses of each sectorization algorithm. Keywords-airspace design; capacity management; dynamic airspace configuration